Simple Monadic Theories
نویسندگان
چکیده
From 28.10. to 02.11.2007, the Dagstuhl Seminar 07441 Algorithmic-Logical Theory of In nite Structures was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The rst section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
منابع مشابه
Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract)
The concept of iteration theory of Bloom and Ésik summarizes all equational properties that iteration has in usual applications, e.g., in Domain Theory where to every system of recursive equations the least solution is assigned. However, this assignment in Domain Theory is also functorial. Yet, functoriality is not included in the definition of iteration theory. Pitty: functorial iteration theo...
متن کاملOn Cloning Context-Freeness
A first-order language is called monadic if its non-logical vocabulary lacks both function symbols and relation symbols of arity greater than one. Formulas of this kind of language can be mechanically tested for validity but its expressive power seems to be too restricted to be of any interest for linguistics. Monadic second-order languages on the other hand extend the language of (full) first-...
متن کاملOn Monadic Theories of Monadic Predicates
Pioneers of logic, among them J.R. Büchi, M.O. Rabin, S. Shelah, and Y. Gurevich, have shown that monadic second-order logic offers a rich landscape of interesting decidable theories. Prominent examples are the monadic theory of the successor structure S1 = (N,+1) of the natural numbers and the monadic theory of the binary tree, i.e., of the two-successor structure S2 = ({0, 1} ∗, ·0, ·1). We c...
متن کاملDecidability and Complexity of Finitely Closable Linear Equational Theories
We deene a subclass of the class of linear equational theories, called nitely closable linear theories. We consider uniication problems with no repeated variables. We show the decidability of this subclass, and give an algorithm in PSPACE. If all function symbols are monadic, then the running time is in NP, and quadratic for unitary monadic nitely closable linear theories.
متن کاملOn countable chains having decidable monadic theory
Rationals and countable ordinals are important examples of structures with decidable monadic second-order theories. A chain is an expansion of a linear order by monadic predicates. We show that if the monadic second-order theory of a countable chain C is decidable then C has a non-trivial expansion with decidable monadic second-order theory.
متن کاملInfinite and Bi-infinite Words with Decidable Monadic Theories
We study word structures of the form (D,<,P ) where D is either N or Z, < is the natural linear ordering on D and P ⊆ D is a predicate on D. In particular we show: (a) The set of recursive ω-words with decidable monadic second order theories is Σ3complete. (b) Known characterisations of the ω-words with decidable monadic second order theories are transfered to the corresponding question for bi-...
متن کامل